/**
 * Created with IntelliJ IDEA.
 * Description: leetcode.简单题.整数转换
 */

class Solution {
    public int convertInteger(int A, int B) {
        int count = 0;
        int n = A ^ B;
        while(n != 0){
            n &= (n - 1);
            count++;
        }
        return count;
    }
}

public class Test {
}
